Contextualizing DL Axioms: Formalization, a New Approach, and Its Properties

نویسندگان

  • Antoine Zimmermann
  • José M. Giménez-García
چکیده

We address the problem of providing contextual information about a logical formula (e.g., provenance, date of validity, or confidence) and representing it within a logical system. In this case, it is needed to rely on a higher order or non standard formalism, or some kind of reification mechanism. We explore the case of reification and formalize the concept of contextualizing logical statements in the case of Description Logics. Then, we define several properties of contextualization that are desirable. No previous approaches satisfy all of the them. Consequently, we define a new way of contextually annotating statements. It is inspired by NdFluents, which is itself an extension of the 4dFluents approach for annotating statements with temporal context. In NdFluents, instances that are involved in a contextual statement are sliced into contextual parts, such that only parts in the same context hold relations to one another, with the goal of better preserving inferences. We generalize this idea by defining contextual parts of relations and classes. This formal construction better satisfies the properties, although not entirely. We show that it is a particular case of a general mechanism that NdFluents also instantiates, and present other variations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Logical Model of Knowledge

There are several approaches to formalizing knowledge. The concept of knowledge is often introduced by a special operator whose properties are defined by a number of axioms. A situation is then modelled by using this operator in problem-specific axioms. This article presents a different approach a first-order logical model which does not use any new operators. The properties of knowledge should...

متن کامل

Formalizing Abstract Algebra in Constructive Set Theory

We present a machine-checked formalization of elementary abstract algebra in constructive set theory. Our formalization uses an approach where we start by specifying the group axioms as a collection of inference rules, defining a logic for groups. Then we can tell whether a given set with a binary operation is a group or not, and derive all properties of groups constructively from these inferen...

متن کامل

Semantic-based Anomalous Pattern Discovery in Moving Object Trajectories

In this work, we investigate a novel semantic approach for pattern discovery in trajectories that, relying on ontologies, enhances object movement information with event semantics. The approach can be applied to the detection of movement patterns and behaviors whenever the semantics of events occurring along the trajectory is, explicitly or implicitly, available. In particular, we tested it aga...

متن کامل

Armstrong ’ s Axioms 1

We present a formalization of the seminal paper by W. W. Armstrong [1] on functional dependencies in relational data bases. The paper is formalized in its entirety including examples and applications. The formalization was done with a routine effort albeit some new notions were defined which simplified formulation of some theorems and proofs. The definitive reference to the theory of relational...

متن کامل

Białystok Armstrong ’ s Axioms 1 William W . Armstrong Dendronic Decisions Ltd

We present a formalization of the seminal paper byW.W. Armstrong [1] on functional dependencies in relational data bases. The paper is formalized in its entirety including examples and applications. The formalization was done with a routine effort albeit some new notions were defined which simplified formulation of some theorems and proofs. The definitive reference to the theory of relational d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017